On-the-fly Curve-skeleton Computation for 3D Shapes
نویسندگان
چکیده
The curve-skeleton of a 3D object is an abstract geometrical and topological representation of its 3D shape. It maps the spatial relation of geometrically meaningful parts to a graph structure. Each arc of this graph represents a part of the object with roughly constant diameter or thickness, and approximates its centerline. This makes the curve-skeleton suitable to describe and handle articulated objects such as characters for animation. We present an algorithm to extract such a skeleton on-the-fly, both from point clouds and polygonal meshes. The algorithm is based on a deformable model evolution that captures the object’s volumetric shape. The deformable model involves multiple competing fronts which evolve inside the object in a coarse-to-fine manner. We first track these fronts’ centers, and then merge and filter the resulting arcs to obtain a curve-skeleton of the object. The process inherits the robustness of the reconstruction technique, being able to cope with noisy input, intricate geometry and complex topology. It creates a natural segmentation of the object and computes a center curve for each segment while maintaining a full correspondence between the skeleton and the boundary of the object.
منابع مشابه
Probabilistic View-based 3D Curve Skeleton Computation on the GPU
Computing curve skeletons of 3D shapes is a challenging task. Recently, a high-potential technique for this task was proposed, based on integrating medial information obtained from several 2D projections of a 3D shape (Livesu et al., 2012). However effective, this technique is strongly influenced in terms of complexity by the quality of a so-called skeleton probability volume, which encodes pot...
متن کاملCurve skeleton extraction by coupled graph contraction and surface clustering
In this paper, we present a practical algorithm to extract a curve skeleton of a 3D shape. The core of our algorithm comprises coupled processes of graph contraction and surface clustering. Given a 3D shape represented by a triangular mesh, we first construct an initial skeleton graph by directly copying the connectivity and geometry information from the input mesh. Graph contraction and surfac...
متن کاملUsing Polyballs to Approximate Shapes and Skeletons
This paper presents an approach to approximate the skeleton of continuous shapes either in 2D or 3D space. The data required is a sampling of the boundary of the shape. We call polyball any nite union of balls. A preliminary work on polyballs shows that their skeletons consist of simple components (line segments in 2D and polygons in 3D). To construct these components, only the computation of a...
متن کاملSkeletal Reconstruction of Branching Shapes
We present a new method for the implicit reconstruction of branching shapes from a set of scattered data points. The method is based on the computation of a geometric skeleton inside the data set. This skeleton is simplified in order to filter noise and converted into skeletal elements – a graph of interconnected curves – that generate an implicit surface. We use Bézier triangles as extra skele...
متن کاملSkeleton-Intrinsic Symmetrization of Shapes
Enhancing the self-symmetry of a shape is of fundamental aesthetic virtue. In this paper, we are interested in recovering the aesthetics of intrinsic reflection symmetries, where an asymmetric shape is symmetrized while keeping its general pose and perceived dynamics. The key challenge to intrinsic symmetrization is that the input shape has only approximate reflection symmetries, possibly far f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Comput. Graph. Forum
دوره 26 شماره
صفحات -
تاریخ انتشار 2007